A refined and asymptotic analysis of optimal stopping problems of Bruss and Weber
نویسنده
چکیده
The classical secretary problem has been generalized over the years into several directions. In this paper we confine our interest to those generalizations which have to do with the more general problem of stopping on a last observation of a specific kind. We follow Dendievel [10], [11], (where a bibliography can be found) who studies several types of such problems, mainly initiated by Bruss [3] and [5], Weber [17] and [18]. Whether in discrete time or continuous time, whether all parameters are known or must be sequentially estimated, we shall call such problems simply Bruss-Weber problems. Our contribution in the present paper is a refined analysis of several problems in this class and a study of the asymptotic behaviour of solutions. The problems we consider center around the following model. Let X1, X2, . . . , Xn be a sequence of independent random variables which can take three values: {+1,−1, 0}. Let p := P(Xi = 1), p′ := P(Xi = −1), q̃ := P(Xi = 0), p ≥ p′, where p+ p′ + q̃ = 1. The goal is to maximize the probability of stopping on a value +1 or −1 appearing for the last time in the sequence. Following a suggestion by Bruss, we have also analyzed an x-strategy with incomplete information: the cases p known, n unknown, then n known, p unknown and finally n, p unknown are considered. We also present simulations of the corresponding complete selection algorithm.
منابع مشابه
Lower Bounds for Bruss' Odds Problem with Multiple Stoppings
This paper deals with Bruss’ odds problem with multiple stopping chances. A decision maker observes sequentially a sequence of independent 0/1 (failure/success) random variables with the objective to predict the last success correctly with multiple stopping chances. First, we give a nontrivial lower bound of the probability of win (obtaining the last success) for the problem with m-stoppings. N...
متن کاملCompare the ratio of symmetric polynomials of odds to one and stop
In this paper, we deals with an optimal stopping problem that maximizes the probability of selecting k out of the last l success, given a sequence of independent Bernoulli trials of length N, where k and l are predetermined integers satisfying 1 ≤ k ≤ l < N . This problem includes some natural problems as special cases, e.g., Bruss’ odds problem, Bruss and Paindaveine’s problem of selecting the...
متن کاملOn asymptotic stability of Weber fractional differential systems
In this article, we introduce the fractional differential systems in the sense of the Weber fractional derivatives and study the asymptotic stability of these systems. We present the stability regions and then compare the stability regions of fractional differential systems with the Riemann-Liouville and Weber fractional derivatives.
متن کاملMinimizing the Expected Rank with Full Information
The full-information secretary problem in which the objective is to minimize the expected rank is seen to have a value smaller than 7/3 for all n (the number of options). This can be achieved by a simple memoryless threshold rule. The asymptotically optimal value for the class of such rules is about 2.3266. For a large finite number of options, the optimal stopping rule depends on the whole seq...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1705.09482 شماره
صفحات -
تاریخ انتشار 2017